Column Weight Two and Three LDPC Codes with High Rates and Large Girths

نویسندگان

  • Mohammad Gholami
  • Ghaffar Raeisi
چکیده

In this paper, the concept of the broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. Interestingly, the constructed regular cycle codes with row-weights t, 3 ≤ t ≤ 20, t 6= 7, 15, 16, have the best lengths among the known regular girth-12 cycle codes. In addition, the proposed cycle codes can be easily extended to some high rate column weight-3 LDPC codes with girth 6. Simulation results show that the constructed column weight 3 QC LDPC codes remarkably outperform QC LDPC codes based on Steiner triple systems and integer lattices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-Girth Column-Weight Two QC-LDPC Codes

This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The proposed method could easily construct codes with girths large than 12 and is more flexible compared to previous methods. Obtained codes show good bit error rate performance compar...

متن کامل

Quasi Cyclic LDPC Codes Based on Finite Set Systems

A finite set system (FSS) is a pair (V,B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called blocks. In this paper, finite set systems are used to define a class of Quasi-cyclic lowdensity parity-check (LDPC) codes, called FSS codes, such that the constructed codes possess large girth and arbitrary column-weight d...

متن کامل

High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs

LDPC codes of columnweight of two are constructed fromminimal distance graphs or cages. Distance graphs are used to represent LDPC code matrices such that graph vertices that represent rows and edges are columns. The conversion of a distance graph into matrix form produces an adjacency matrix with column weight of two and girth double that of the graph. The number of 1’s in each row (row weight...

متن کامل

Quasi-Cyclic LDPC Codes of Column-Weight Two Using a Search Algorithm

This article introduces a search algorithm for constructing quasi-cyclic LDPC codes of column-weight two. To obtain a submatrix structure, rows are divided into groups of equal sizes. Rows in a group are connected in their numerical order to obtain a cyclic structure. Two rows forming a column must be at a specified distance from each other to obtain a given girth. The search for rows satisfyin...

متن کامل

Design of Structured Regular LDPC Codes without Short Cycles using Gray Code Representations

Low Density Parity Check (LDPC) codes are specified by the parity check matrix H. Smaller girths in the Tanner graphs of LDPC codes prevent the sum-product algorithm from converging, i.e., short cycles in H-matrix degrade the performance of LDPC decoder. In this paper, we present an algorithm for constructing LDPC codes without short cycles. The H-matrix must be sufficiently sparse to increase ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1403.6090  شماره 

صفحات  -

تاریخ انتشار 2014